Substitution Attacks against Message Authentication
نویسندگان
چکیده
منابع مشابه
Multiple forgery attacks against Message Authentication Codes
Some message authentication codes (MACs) are vulnerable to multiple forgery attacks, in which an attacker can gain information that allows her to succeed in forging multiple message/tag pairs. This property was first noted in MACs based on universal hashing, such as the Galois/Counter Mode (GCM) of operation for block ciphers. However, we show that CBC-MAC and HMAC also have this property, and ...
متن کاملMessage Authentication Codes Secure against Additively Related-Key Attacks
Message Authentication Code (MAC) is one of most basic primitives in cryptography. After Biham (EUROCRYPT 1993) and Knudsen (AUSCRYPT 1992) proposed related-key attacks (RKAs), RKAs have damaged MAC’s security. To relieve MAC of RKA distress, Bellare and Cash proposed pseudo-random functions (PRFs) secure against multiplicative RKAs (CRYPTO 2010). They also proposed PRFs secure against additive...
متن کامل.1 Attacks on Message Authentication Schemes
• a tagging algorithm Tag : {0, 1}∗ × {0, 1}∗ → {0, 1}∗ that maps a pair consisting of a key K and messageM to a tag σ = TagK(M) = Tag(K,M). • a verification algorithm V erify : {0, 1}∗×{0, 1}∗×{0, 1}∗ → {0, 1} that takes a keyK, a messageM , and a string σ and produces a bit of output. We require that V erifyK(M,σ) = V erify(K,M, σ) if and only if σ is a possible output of TagK(M). For K ∈ {0,...
متن کاملHMAC-Based Authentication Protocol: Attacks and Improvements
As a response to a growing interest in RFID systems such as Internet of Things technology along with satisfying the security of these networks, proposing secure authentication protocols are indispensable part of the system design. Hence, authentication protocols to increase security and privacy in RFID applications have gained much attention in the literature. In this study, security and privac...
متن کاملSecure Message Authentication Against Related-Key Attack
Security against related-key attacks is an important criteria for modern cryptographic constructions. In the related-key setting, the adversary has the ability to query the underlying function on the target key as well as on some related-keys. Although provable security against related-key attack has received considerable attention in recent years, most of the results in the literature aim to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Symmetric Cryptology
سال: 2019
ISSN: 2519-173X
DOI: 10.46586/tosc.v2019.i3.152-168